Decompositions of Complete Multigraphs Related to Hadamard Matrices
نویسندگان
چکیده
Let bp(+Kv) be the minimum number of complete bipartite subgraphs needed to partition the edge set of +Kv , the complete multigraph with + edges between each pair of its v vertices. Many papers have examined bp(+Kv) for v 2+. For each + and v with v 2+, it is shown here that if certain Hadamard and conference matrices exist, then bp(+Kv) must be one of two numbers. Also, generalizations to decompositions and covers by complete s-partite subgraphs are discussed and connections to designs and codes are presented. 1998 Academic Press
منابع مشابه
Weak log-majorization inequalities of singular values between normal matrices and their absolute values
This paper presents two main results that the singular values of the Hadamard product of normal matrices $A_i$ are weakly log-majorized by the singular values of the Hadamard product of $|A_{i}|$ and the singular values of the sum of normal matrices $A_i$ are weakly log-majorized by the singular values of the sum of $|A_{i}|$. Some applications to these inequalities are also given. In addi...
متن کاملThe complete multigraphs and their decompositions into open trails
Balister [Combin. Probab. Comput. 12 (2003), 1–15] gave a necessary and sufficient condition for a complete multigraph Kn to be arbitrarily decomposable into closed trails of prescribed lengths. In this article we solve the corresponding problem showing that the multigraphs Kn are arbitrarily decomposable into open trails.
متن کاملDecompositions Of λKv Into Multigraphs With Four Vertices And Five Edges
This paper is motivated by a survey on the existence of G-designs by Adams, Bryant and Buchanan, where they gave the spectrum of the decomposition of complete graphs into graphs with small numbers of vertices. We give difference family-type constructions to decompose λ copies, where λ ≥ 2, of the complete graph K v into several multigraphs on four vertices and five edges including so called " 2...
متن کاملNew Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences
AHadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three new constructions of CNC Hadamard matrices. We give a primary construction using a flipping operation on the submatrices of the reduced form of a Hadamard matrix. We show that, up to some restrictions, the Kronecker p...
متن کاملDecompositions of multigraphs into parts with two edges
Given a family F of multigraphs without isolated vertices, a multigraph M is called F-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of F . We present necessary and sufficient conditions for the existence of such decompositions if F comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 82 شماره
صفحات -
تاریخ انتشار 1998